Finding Convincing Arguments Using Scalable Bayesian Preference Learning
نویسندگان
چکیده
منابع مشابه
Scalable Collaborative Bayesian Preference Learning
Learning about users’ utilities from preference, discrete choice or implicit feedback data is of integral importance in e-commerce, targeted advertising and web search. Due to the sparsity and diffuse nature of data, Bayesian approaches hold much promise, yet most prior work does not scale up to realistic data sizes. We shed light on why inference for such settings is computationally difficult ...
متن کاملDiaLaw: Levels, Dialog Trees, Convincing Arguments
DiaLaw is a dialogical model of legal justification. An important characteristic of the formal and implemented model DiaLaw is that both logic-based arguments and mere convincing statements can be modelled. The support of both structural (logic-based) arguments and procedural arguments (mere convincing statements) is expressed by different levels in the dialog. In this paper so-called dialog tr...
متن کاملSocial values as arguments: similar is convincing
Politicians, philosophers, and rhetors engage in co-value argumentation: appealing to one value in order to support another value (e.g., "equality leads to freedom"). Across four experiments in the United Kingdom and India, we found that the psychological relatedness of values affects the persuasiveness of the arguments that bind them. Experiment 1 found that participants were more persuaded by...
متن کاملSolving Selection Problems Using Preference Relation Based on Bayesian Learning
This paper defines a selection problem which selects an appropriate object from a set that is specified by parameters. We discuss inductive learning of selection problems and give a method combining inductive logic programming (ILP) and Bayesian learning. It induces a binary relation comparing likelihood of objects being selected. Our methods estimate probability of each choice by evaluating va...
متن کاملScalable Preference Learning from Data Streams
We study the task of learning the preferences of online readers of news, based on their past choices. Previous work has shown that it is possible to model this situation as a competition between articles, where the most appealing articles of the day are those selected by the most users. The appeal of an article can be computed from its textual content, and the evaluation function can be learned...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Association for Computational Linguistics
سال: 2018
ISSN: 2307-387X
DOI: 10.1162/tacl_a_00026